package com.problem.leetcode;

/**
 * @author didi
 * @DESCRIPTION 136
 * @create 2019-04-28 13:38
 **/

public class Problem136 {
    public int singleNumber(int[] nums) {
        int result = 0;
        for (int index = 0; index < nums.length; index++) {
            result ^= nums[index];
        }
        return result;
    }
}
